#define _CRT_SECURE_NO_WARNINGS
#include"Binary_Search_Tree.h"
int main() {
	int arr[] = { 8,5,15,4,7,3,1,10,16,14,9,20,2 };
	BSTree<int> t;
	for (auto num : arr) {
		t.Insert(num);
	}
	t._InOrder();

	return 0;
}